Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
نویسندگان
چکیده
منابع مشابه
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to incorporating only local interactions and cannot model global properties such as connectedness, which is a potentially useful high-level prior for object segmentation. In this work, we overcome this limitation by deri...
متن کاملSupplementary Materials: Global Connectivity Potentials for Random Field Models
Proof to Lemma 2. First, yi ≥ 0. For each i, we construct |V | affinely independent points in C with yi = 0. Fix i, then one solution is obviously x = 0, the empty subgraph. Next, for all p 6= i, obtain one solution by setting only yp = 1, and for all j 6= p set yj = 0. Clearly, yj = 0 and the |V | − 1 solutions thus obtained are affinely independent. In total we have |V | solutions with yi = 0...
متن کاملMulti-field Inflation with a Random Potential
Motivated by the possibility of inflation in the cosmic landscape, which may be approximated by a complicated potential, we study the density perturbations in multi-field inflation with a random potential. The random potential causes the inflaton to undergo a Brownian motion with a drift in the D-dimensional field space, allowing the entropic perturbation modes to continuously and randomly feed...
متن کاملPotential Drug Interactions in War-Injured Veterans
Drug-drug interaction (DDI) is one of the most important problems in the treatment of patients suffering from different chronic intractable diseases. The war-injured veterans are one of the groups that are prone to chronic refractory diseases. This investigation was conducted on war-injured veterans treated in a multi-disciplinary clinic in Tehran. Using Poisson model, a total of 150 patients w...
متن کاملConnectedness of Certain Random Graphs
L. Dubins conjectured in 1984 that the graph on vertices {1 , 2 , 3 , . . . } where an edge isdrawn between vertices i and j with probability p i j = λ/max (i , j) independently for each pair iand j is a.s. connected for λ = 1. S. Kalikow and B. Weiss proved that the graph is a.s.connected for any λ > 1. We prove Dubin’s conjecture and show that the graph is a.s. connectedfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Imaging Sciences
سال: 2010
ISSN: 1936-4954
DOI: 10.1137/090752614